Cycles in graphs of fixed girth with large size
نویسندگان
چکیده
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
منابع مشابه
On the Extremal Regular Directed Graphs without Commutative Diagrams and Their Applications in Coding Theory and Cryptography
We use term regular directed graph (r. d. g.) for the graph of irreflexive binary relation with the constant number outputs (or inputs) for each vertex. The paper is devoted to studies of maximal size ER(d, v) of r. d. g. of order v without commutative diagrams formed by two directed passes of length < d with the common starting and ending points. We introduce the upper bound for ER(d, v), whic...
متن کاملComplete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this theorem to show that for any fixed k a random cubic graph contains a Kk-minor asymptotically almost surely.
متن کاملNearly optimal embedding of trees
In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be close to the minimum degree of G. For example, we prove that any graph of minimum degree d without 4-cycles contains every tree of size ǫd and maximum degree a...
متن کامل4-critical Graphs on Surfaces without Contractible (<=4)-cycles
We show that if G is a 4-critical graph embedded in a fixed surface Σ so that every contractible cycle has length at least 5, then G can be expressed as G = G′ ∪ G1 ∪ G2 ∪ . . . ∪ Gk, where |V (G′)| and k are bounded by a constant (depending linearly on the genus of Σ) and G1, . . . , Gk are graphs (of unbounded size) whose structure we describe exactly. The proof is computer-assisted—we use co...
متن کاملThe analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
The analysis of probabilistic algorithms has proved to be very successful for finding asymptotic bounds on parameters of random regular graphs. In this paper, we show that similar ideas may be used to obtain deterministic bounds for one such parameter in the case of regular graphs with large girth. More precisely, we address the problem of finding a large induced forest in a graph G, by which w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 62 شماره
صفحات -
تاریخ انتشار 2017